package 动态规划;

import java.util.Arrays;

public class LeetCode198_打家劫舍 {
    public int rob(int[] nums) {
        if(nums == null) {
            return 0;
        }
        if(nums.length <= 2) {
            Arrays.sort(nums);
            return nums[nums.length-1];
        }
        int[] dp = new int[nums.length];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);
        for(int i = 2; i < nums.length; i++) {
            dp[i] = Math.max(dp[i-1], dp[i-2] + nums[i]);
        }
        return dp[nums.length-1];
    }
}
